Search results for "Closure operator"
showing 5 items of 5 documents
An Approach to the Concept of Soft Fuzzy Proximity
2014
The purpose of this paper is to introduce the concept of soft fuzzy proximity. Firstly, we give the definitions of soft fuzzy proximity and Katsaras soft fuzzy proximity, and also we investigate the relations between the soft fuzzy proximity and slightly modified version of Katsaras soft fuzzy proximity. Secondly, we induce a soft fuzzy topology from a given soft fuzzy proximity by using soft fuzzy closure operator. Then, we obtain the initial soft fuzzy proximity from a given family of soft fuzzy proximities. So, we describe products in the category of soft fuzzy proximities. Finally, we show that a family of all soft fuzzy proximities on a given set constitutes a complete lattice.
Equivalence closure in the two-variable guarded fragment
2015
We consider the satisfiability and finite satisfiability problems for the extension of the two-variable guarded fragment in which an equivalence closure operator can be applied to two distinguished binary predicates. We show that the satisfiability and finite satisfiability problems for this logic are 2-ExpTime-complete. This contrasts with an earlier result that the corresponding problems for the full two-variable logic with equivalence closures of two binary predicates are 2-NExpTime-complete.
Two-Variable First-Order Logic with Equivalence Closure
2012
We consider the satisfiability and finite satisfiability problems for extensions of the two-variable fragment of first-order logic in which an equivalence closure operator can be applied to a fixed number of binary predicates. We show that the satisfiability problem for two-variable, first-order logic with equivalence closure applied to two binary predicates is in 2-NExpTime, and we obtain a matching lower bound by showing that the satisfiability problem for two-variable first-order logic in the presence of two equivalence relations is 2-NExpTime-hard. The logics in question lack the finite model property; however, we show that the same complexity bounds hold for the corresponding finite sa…
Lattice of closure endomorphisms of a Hilbert algebra
2019
A closure endomorphism of a Hilbert algebra [Formula: see text] is a mapping that is simultaneously an endomorphism of and a closure operator on [Formula: see text]. It is known that the set [Formula: see text] of all closure endomorphisms of [Formula: see text] is a distributive lattice where the meet of two elements is defined pointwise and their join is given by their composition. This lattice is shown in the paper to be isomorphic to the lattice of certain filters of [Formula: see text], anti-isomorphic to the lattice of certain closure retracts of [Formula: see text], and compactly generated. The set of compact elements of [Formula: see text] coincides with the adjoint semilattice of …
A characterization of the n-ary many-sorted closure operators and a many-sorted Tarski irredundant basis theorem
2018
A theorem of single-sorted algebra states that, for a closure space (A, J ) and a natural number n, the closure operator J on the set A is n-ary if and only if there exists a single-sorted signature Σ and a Σ-algebra A such that every operation of A is of an arity ≤ n and J = SgA, where SgA is the subalgebra generating operator on A determined by A. On the other hand, a theorem of Tarski asserts that if J is an n-ary closure operator on a set A with n ≥ 2, then, for every i, j ∈ IrB(A, J ), where IrB(A, J ) is the set of all natural numbers which have the property of being the cardinality of an irredundant basis (≡ minimal generating set) of A with respect to J , if i < j and {i + 1, . . . …